Global Optimization by Differential Evolution and Particle Swarm Methods Evaluation on Some Benchmark Functions

نویسندگان

  • SK Mishra
  • William Karush
  • Leonid Kantorovich
  • Harold Kuhn
  • Albert Tucker
  • Stanislaw Ulam
  • John von Neumann
  • Aimo Törn
چکیده

I. A Brief History of Optimization Research: The history of optimization of realvalued non-linear functions (including linear ones), unconstrained or constrained, goes back to Gottfried Leibniz, Isaac Newton, Leonhard Euler and Joseph Lagrange. However, those mathematicians often assumed differentiability of the optimand as well as constraint functions. Moreover, they often dealt with the equality constraints. Richard Valentine (1937) and William Karush (1939), however, were perhaps the first mathematicians to study optimization of nonlinear functions under inequality constraints. Leonid Kantorovich and George Dantzig are well known for developing and popularizing linear programming, which ushered a new era of ‘operations research’, a branch of mathematical science that specializes in optimization. The development of linear programming soon prompted the study of the optimization problem of nonlinear functions (often under linear or nonlinear constraints). The joint work of Harold Kuhn and Albert Tucker (1951) – that was backed up by the work of Karush – is a landmark in the history of optimization of nonlinear functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Social Spider Optimization Algorithm with Differential Evolution for Global Optimization

Social Spider Optimization (SSO) algorithm is a swarm intelligence optimization algorithm based on the mating behavior of social spiders. Numerical simulation results have shown that SSO outperformed some classical swarm intelligence algorithms such as Particle Swarm Optimization (PSO) algorithm and Artificial Bee Colony (ABC) algorithm and so on. However, there are still some deficiencies abou...

متن کامل

Human Group Optimizer with Local Search

Human Group Optimization (HGO) algorithm, derived from the previously proposed seeker optimization algorithm (SOA), is a novel swarm intelligence algorithm by simulating human behaviors, especially human searching/foraging behaviors. In this paper, a canonical HGO with local search (L-HGO) is proposed. Based on the benchmark functions provided by CEC2005, the proposed algorithm is compared with...

متن کامل

Particle swarm optimization: Hybridization perspectives and experimental illustrations

Metaheuristic optimization algorithms have become popular choice for solving complex and intricate problems which are otherwise difficult to solve by traditional methods. In the present study an attempt is made to review the hybrid optimization techniques in which one main algorithm is a well known metaheuristic; particle swarm optimization or PSO. Hybridization is a method of combining two (or...

متن کامل

Hybrid Particle Swarm Optimisation Algorithms Based on Differential Evolution and Local Search

Particle Swarm Optimisation (PSO) is an intelligent search method based on swarm intelligence and has been widely used in many fields. However it is also easily trapped in local optima. In this paper, we propose two hybrid PSO algorithms: one uses a Differential Evolution (DE) operator to replace the standard PSO method for updating a particle’s position; and the other integrates both the DE op...

متن کامل

A New Hybrid Algorithm of Differential Evolution Algorithm and Particle Swarm Algorithm

In this paper, we point out some shortcomings of Differential evolution algorithm (DE) with lower search efficiency and advance to the local optimal value easily. Combining with particle swarm algorithm (PSO)’s advantages of convergence rate, we put forward a new hybrid algorithm (DPM) to overcome these shortcomings. Instead of dividing all individuals into two equal size groups, in DPM algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006